Cells can update state at each step according to current state and neighboring-cell states {cellular automaton}|. Automata can have tapes with more than one dimension, with Turing machines at tape segments {node, tape segment}. Cells can have only one state and interact only with neighbors. Combining state and neighbor states determines cell next state [Wolfram, 2002].
For fixed cell number, one cell can have one state and update at each step, and system can move to another cell {mobile automaton}, according to neighboring cell states.
Outline of Knowledge Database Home Page
Description of Outline of Knowledge Database
Date Modified: 2022.0225